Caching in networks: non uniform algorithms and memory capacity constraints
نویسنده
چکیده
additional members of the examination board. I would like to thank my " co-advisor " Berthold Vöcking for a very valuable collaboration. It was a lot of fun to master several problems in theoretical computer science and other major spheres of life with Berthold, such as solving a traveling salesperson problem given by the touristic highlights in California and changing several car tires with unconventional tools in the forests of Massachusetts during one night. Also, many thanks to Christian Sohler, Klaus Schröder, Harald Räcke, and Christof Krick for many great discussions about computer science and other significant aspects of society.
منابع مشابه
Caching in Networks
We present a general framework for the development of online algorithms for data management in networks with limited memory capacities. These algorithms dynamically create and delete copies of shared data objects that can be read and written by the nodes in the network. Our algorithms aim to minimize the congestion, i.e., the maximum communication load over all network resources, so that that n...
متن کاملEfficient Barriers for Distributed Shared Memory Computers
Barrier algorithms are central to the performance of numerous algorithms on scalable, high-performance architectures. Numerous barrier algorithms have been suggested and studied for Non-Uniform Memory Access (NUMA) architectures, but less work has been done for Cache Only Memory Access (COMA) or attraction memory 2] architectures such as the KSR-1. In this paper, we present two new barrier algo...
متن کاملEecient Barriers for Distributed Shared Memory Computers University of Colorado at Boulder Eecient Barriers for Distributed Shared Memory Computers
Barrier algorithms are central to the performance of numerous algorithms on scalable, high-performance architectures. Numerous barrier algorithms have been suggested and studied for Non-Uniform Memory Access (NUMA) architectures, but less work has been done for Cache Only Memory Access (COMA) or attraction memory 2] architectures such as the KSR-1. In this paper, we present two new barrier algo...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000